Comparing Wiener complexity with eccentric complexity

The transmission of a vertex v graph G is the sum distances from to all other vertices in . Wiener complexity number different transmissions its vertices. Similarly, eccentric defined as eccentricities In this paper these two complexities are compared. first studied on Cartesian product graphs. Transmission indivisible graphs and arithmetic introduced demonstrate sharpness upper lower bounds complexity, respectively. It shown that for almost not smaller than complexity. This property proved trees, equality holding precisely center-regular trees. Several families which equal constructed. Using product, it can be arbitrarily larger Additional infinite with constructed by amalgamating universally diametrical